Dynamic Programming Approach for Prize Colleting Travelling Salesman Problem with Time Windows
نویسندگان
چکیده
منابع مشابه
Beam-ACO for the travelling salesman problem with time windows
The travelling salesman problem with time windows is a difficult optimization problem that arises, for example, in logistics. This paper deals with the minimization of the travel-cost. For solving this problem, this paper proposes a Beam-ACO algorithm, which is a hybrid method combining ant colony optimization with beam search. In general, Beam-ACO algorithms heavily rely on accurate and comput...
متن کاملA Bi-directional Resource-bounded Dynamic Programming Approach for the Traveling Salesman Problem with Time Windows
This paper presents a bi-directional resource-bounded label correcting algorithm for the traveling salesman problem with time windows, in which the objective is to minimize travel times. Label extensions and dominance start simultaneously in both forward and backward directions: the forward direction from the starting depot and the backward direction from the terminating depot. The resultant la...
متن کاملAn integer programming approach for the time-dependent traveling salesman problem with time windows
Congestion in large cities and populated areas is one of the major challenges in urban logistics, and should be addressed at different planning and operational levels. The Time Dependent Travelling Salesman Problem (TDTSP) is a generalization of the well known Traveling Salesman Problem (TSP) where the travel times are not assumed to be constant along the day. The motivation to consider the tim...
متن کاملHybrid Metaheuristic for the Prize Collecting Travelling Salesman Problem
The Prize Collecting Traveling Salesman Problem (PCTSP) can be associated to a salesman that collects a prize in each city visited and pays a penalty for each city not visited, with travel costs among the cities. The objective is to minimize the sum of travel costs and penalties, while including in the tour enough cities to collect a minimum prize. This paper presents one solution procedure for...
متن کاملA Computational Study of Bi-directional Dynamic Programming for the Traveling Salesman Problem with Time Windows
This paper presents computational studies for the traveling salesman problem with time windows by applying a bi-directional resource-bounded label correcting algorithm. Label extensions and dominance start simultaneously in both forward and backward directions: the forward direction from the starting depot and the backward direction from the terminating depot. The resultant label extension proc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IE interfaces
سال: 2011
ISSN: 1225-0996
DOI: 10.7232/ieif.2011.24.2.112